Representation of Bayesian Networks as Relational Databases

نویسندگان

  • S. K. Michael Wong
  • Yang Xiang
  • Xiaopin Nie
چکیده

A Bayesian network can be regarded as a summary of a domain expert’s experience with an implicit population. A database can be regarded as a detailed documentation of such an experience with an explicit population. This connection between Bayesian networks and databases is well recognized and have been pursued for knowledge acquisition [1, 2, 11]. Existing databases are treated as information resources. Automatic generation of Bayesian networks from databases are studied as a way to bypass the knowledge acquisition bottleneck. Once Bayesian networks are generated, databases are regarded as no longer relevant to the evidential reasoning process in Bayesian networks. Much evidence suggests that even deeper connection between Bayesian networks and relational databases exists. Relational databases manipulate tables of tuples, and Bayesian networks manipulate tables of probabilities. Relational databases answer queries that involve attributes in multiple relations by joining the relations and then projecting to the set of target attributes. In Bayesian networks, joint distributions are defined by products of local distributions, and belief updating [9] computes the marginalization of joint distributions. Relational databases make use of junction (join) trees in database design [7]. Multiply connected Bayesian networks are transformed into junction trees [5] or junction forests [13] to achieve inference efficiency. Scenario based explanation [3] in Bayesian networks uses the most likely configurations, which are equavalent to the universal tuples that repeat most frequently if we allow repetition in the database. Sequential updating (learning) of conditional probabilities [10, 12] in Bayesian networks makes use of new cases which are new tuples in databases. The paper explores the connection between Bayesian networks and relational databases. We presents a representation and inference framework of Bayesian networks using relational databases. The framework is based on the junction tree representation of Bayesian networks [5]. We show that with some minor extension to the conventional relational database model, it can be used to represent Bayesian networks and to perform probabilistic inference. This unified framework formally reveals the close relationship

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Lattice Approach to Bayesian Networks

Bayesian networks and conditional independence is studied via functional dependences. Armstrong’s axioms known from the theory of relational databases is used to reformulate the concept of Bayesian networks into the theory of join-semidistributive lattices. Lattice theory provides us with a richer language to discuss causation than graph theory does.

متن کامل

On the implication problem for probabilistic conditional independency

The implication problem is to test whether a given set of independencies logically implies another independency. This problem is crucial in the design of a probabilistic reasoning system. We advocate that Bayesian networks are a generalization of standard relational databases. On the contrary, it has been suggested that Bayesian networks are different from the relational databases because the i...

متن کامل

Importance Sampling on Relational Bayesian Networks

We present techniques for importance sampling from distributions defined by Relational Bayesian Networks. The methods operate directly on the abstract representation language, and therefore can be applied in situations where sampling from a standard Bayesian Network representation is infeasible. We describe experimental results from using standard, adaptive and backward sampling strategies. Fur...

متن کامل

The Implication of Probabilistic Conditional Independence and Embedded Multivalued Dependency

It has been suggested that Bayesian networks and relational databases are different because the implication problems for probabilistic conditional independence and embedded multivalued dependency do not always coincide. The present study indicates that the implication problems coincide on solvable classes of dependencies and differ on unsolvable classes. We therefore maintain that Bayesian netw...

متن کامل

Temporal Functional Dependencies and Temporal Nodes Bayesian Networks

A temporal nodes Bayesian network (TNBN) is an alternative graphical representation of temporal probabilistic information. The temporal functional dependency is an important data dependency in temporal relational databases. In this paper temporal data dependencies are extended into delayed conditions, called asynchronous dependencies. The purpose of this paper is to set up a connection between ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994